Technische Universit at M U N C H E N Institut F Ur Informatik Similarity-based Lemma Generation with Lemma-delaying Tableaux Enumeration 1997 Sfb 342 Methoden Und Werkzeuge F Ur Die Nutzung Paralleler Architekturen Similarity-based Lemma Generation with Lemma-delaying Tableaux Enumeration
نویسنده
چکیده
The use of bottom-up generated lemmas is an appropriate method for achieving an eeective redundancy control mechanism for connection tableau search procedures as well as for reducing proof lengths. An unbounded use of lemmas, however, usually does not lead to improvements of the search process and can even complicate the search. In order to identify lemmas which are actually relevant for the proof task we develop methods for a similarity-based ltering of lemmas. Similarity between a proof goal and a lemma is measured by simulating a costly but complete tableaux enumeration method (the lemma delaying method) which uses all lemmas to prove the goal and estimating based on this simulation which lemmas may be useful. We investigate this method in detail and introduce several similarity measures. Experiments with the prover Setheo and the lemma generator Delta underline the eeectiveness of the newly developed methods.
منابع مشابه
Technische Universit at M U N C H E N Institut F Ur Informatik Compositional Speciication of Mobile Systems 1997 Sfb 342 Methoden Und Werkzeuge F Ur Die Nutzung Paralleler Architekturen Compositional Speciication of Mobile Systems
This paper generalizes a speciication technique based on input/output relations on streams to describe mobile systems. We consider networks of components communicating asynchronously via unbounded directed channels. Mobility is achieved by allowing the components to communicate channel ports. We distinguish between many-to-many and two v ariants of point-to-point communication. The communicatio...
متن کاملTechnische Universit at M U N C H E N Institut F Ur Informatik Simulation Preorder on Simple Process Algebras 1999 Sfb 342 Methoden Und Werkzeuge F Ur Die Nutzung Paralleler Architekturen Simulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between innnite-state processes and nite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of innnite-state systems and nite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a nite-state one is PS...
متن کاملInstitut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Problem Solving with Model-generation Approaches Based on Puhr Tableaux in Proc. Problem-solving Methodologies with Automated Deduction, Workshop at Cade '98
متن کامل
Charakterisierung der Farbeigenschaften melanozytärer Hautveränderungen zur Unterstützung der Früherkennung des malignen Melanoms
Max-Planck-Institut f ur extraterrestrische Physik, Garching Department of Electrical Engineering, University of Sydney Institut f ur medizinische Statistik und Epidemiologie, TU M unchen Klinik und Poliklinik f ur Dermatologie der Universit at Regensburg Fachbereich Informatik/Mathematik, Fachhochschule M unchen Lehrstuhl f ur Theoretische Informatik und Grundlagen der KI, TU M unchen ...
متن کاملInstitut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Positive Unit Hyper-resolution Tableaux for Minimal Model Generation Positive Unit Hyper-resolution Tableaux for Minimal Model Generation
Minimal Herbrand models for clausal theories are useful in several areas of computer science, e.g. automated theorem proving, program veriication, logic programming, databases, and artiicial intelligence. In most cases, the conventional model generation algorithms are inappropriate because they generate nonminimal Herbrand models and can be ineecient. This article describes a novel approach for...
متن کامل